Direct Reading Algorithm for Hierarchical Clustering
نویسندگان
چکیده
منابع مشابه
Hierarchical Energy Efficient Clustering Algorithm for WSN
The Wireless Sensor Network (WSN) is the collection of large no of low-cost micro-sensors which are used to collect and send various kinds of messages. Energy is the most important aspect of the WSNs because it determines the aliveness of wireless sensor node. In this paper we propose Hierarchical Energy Efficient Clustering Algorithm (HEEC) for WSN. HEEC achieves good performance in terms of r...
متن کاملAn Online Hierarchical Algorithm for Extreme Clustering
Many modern clustering methods scale well to a large number of data items, N , but not to a large number of clusters, K. This paper introduces PERCH, a new non-greedy algorithm for online hierarchical clustering that scales to both massive N and K—a problem setting we term extreme clustering. Our algorithm efficiently routes new data points to the leaves of an incrementally-built tree. Motivate...
متن کاملHierarchical Sequence Clustering Algorithm for Data Mining
Bioinformatics emerged as a challenging new area of research and brought forth numerous computational problems. Here computers are used to gather, store, analyze and merge biological data. In this paper, the problem of clustering interval-scaled data and sequence data is analyzed in a new approach using Hierarchical Sequence Clustering. In Sequence clustering, it is necessary to find the simila...
متن کاملHierarchical clustering algorithm for fast image retrieval
Image retrieval systems that compare the query image exhaustively with each individual image in the database are not scalable to large databases. A scalable search system should ensure that the search time does not increase linearly with the number of images in the database. We present a clustering based indexing technique, where the images in the database are grouped into clusters of images wi...
متن کاملHierarchical Clustering and Genetic Algorithm
The Traveling Salesman Problem(TSP) is one of the most intensively studied problem in computational mathematics. To solve this problem a number of algorithms have been developed using genetic algorithms. But these algorithms are not so suitable for solving large-scale TSP. This paper proposes a new solution for TSP using hierarchical clustering and genetic algorithm. Keywords— Traveling Salesma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2016
ISSN: 1571-0653
DOI: 10.1016/j.endm.2016.11.006